Multiset graph partitioning
نویسندگان
چکیده
Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights.
منابع مشابه
On multiset colorings of graphs
A vertex coloring of a graph G is a multiset coloring if the multisets of colors of the neighbors of every two adjacent vertices are different. The minimum k for which G has a multiset k-coloring is the multiset chromatic number χm(G) of G. For every graph G, χm(G) is bounded above by its chromatic number χ(G). The multiset chromatic numbers of regular graphs are investigated. It is shown that ...
متن کاملReading 12 : Graphs
Graphs are discrete structures that model relationships between objects. Graphs play an important role in many areas of computer science. In this reading we introduce basic notions of graph theory that are important in computer science. In particular we look directed graphs, undirected graphs, trees and some applications of graphs. We begin by discussing directed graphs, also known as digraphs....
متن کاملThe Multiset Chromatic Number of a Graph
A vertex coloring of a graph G is a multiset coloring if the multisets of colors of the neighbors of every two adjacent vertices are different. The minimum k for which G has a multiset k-coloring is the multiset chromatic number χm(G) of G. For every graph G, χm(G) is bounded above by its chromatic number χ(G). The multiset chromatic number is determined for every complete multipartite graph as...
متن کاملType Checking for a Multiset Rewriting Language
We enhance Gamma, a multiset rewriting language, with a notion of structured multiset. A structured multiset is a set of addresses satisfying speci c relations which can be used in the rewriting rules of the program. A type is de ned by a context-free graph grammar and a structured multiset belongs to a type T if its underlying set of addresses satis es the invariant expressed by the grammar de...
متن کاملGraph Multiset Transformation as a Framework for Massively Parallel Computation
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the possibility of massive parallelism in this way. As a consequence, graph problems in the class NP can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 55 شماره
صفحات -
تاریخ انتشار 2002